Possible cardinalities for locating-dominating codes in graphs
نویسندگان
چکیده
منابع مشابه
Extremal cardinalities for identifying and locating-dominating codes in graphs
Consider a connected undirected graph G = (V ,E), a subset of vertices C ⊆ V , and an integer r 1; for any vertex v ∈ V , let Br(v) denote the ball of radius r centred at v, i.e., the set of all vertices linked to v by a path of at most r edges. If for all vertices v ∈ V (respectively, v ∈ V \C), the setsBr(v)∩C are all nonempty and different, then we call C an r-identifying code (respectively,...
متن کاملApproximability of identifying codes and locating-dominating codes
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible to approximate both problems within a logarithmic factor, but sublogarithmic approximation ratios are intractable. In bounded-degree graphs, there is a trivial constant-factor approximation algorithm, but arbitrarily lo...
متن کاملNew results on metric-locating-dominating sets of graphs
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of S, and the minimum cardinality of such a set is called the metric-locationdomination number. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominating sets to other special sets: ...
متن کاملLocating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5
Locating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such that every vertex is uniquely identified by its neighbourhood within the dominating set. In this paper, we study the size of a smallest locating-dominating set or identifying code for graphs of girth at least 5 and o...
متن کاملNew results on variants of covering codes in Sierpiński graphs
In this paper we study identifying codes, locating-dominating codes, and total-dominating codes in Sierpiński graphs. We compute the minimum size of such codes in Sierpiński graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 34 شماره
صفحات -
تاریخ انتشار 2006